Massively Parallel Solver for the High-Order Galerkin Least-Squares Method
نویسندگان
چکیده
A high-order Galerkin Least-Squares (GLS) finite element discretization is combined with massively parallel implicit solvers. The stabilization parameter of the GLS discretization is modified to improve the resolution characteristics and the condition number for the high-order interpolation. The Balancing Domain Decomposition by Constraints (BDDC) algorithm is applied to the linear systems arising from the two-dimensional, high-order discretization of the Poisson equation, the advectiondiffusion equation, and the Euler equation. The Robin-Robin interface condition is extended to the Euler equation using the entropy-symmetrized variables. The BDDC method maintains scalability for the high-order discretization for the diffusiondominated flows. The Robin-Robin interface condition improves the performance of the method significantly for the advection-diffusion equation and the Euler equation. The BDDC method based on the inexact local solvers with incomplete factorization maintains the scalability of the exact counterpart with a proper reordering. Thesis Supervisor: David L. Darmofal Title: Associate Professor of Aeronautics and Astronautics
منابع مشابه
Newton multigrid least-squares FEM for the V-V-P formulation of the Navier-Stokes equations
We solve the V-V-P, vorticity-velocity-pressure, formulation of the stationary incompressible Navier-Stokes equations based on the least-squares finite element method. For the discrete systems, we use a conjugate gradient (CG) solver accelerated with a geometric multigrid preconditioner for the complete system. In addition, we employ a Krylov space smoother inside of the multigrid which allows ...
متن کاملIncompressible laminar flow computations by an upwind least-squares meshless method
In this paper, the laminar incompressible flow equations are solved by an upwind least-squares meshless method. Due to the difficulties in generating quality meshes, particularly in complex geometries, a meshless method is increasingly used as a new numerical tool. The meshless methods only use clouds of nodes to influence the domain of every node. Thus, they do not require the nodes to be conn...
متن کاملA meshless discrete Galerkin method for solving the universe evolution differential equations based on the moving least squares approximation
In terms of observational data, there are some problems in the standard Big Bang cosmological model. Inflation era, early accelerated phase of the evolution of the universe, can successfully solve these problems. The inflation epoch can be explained by scalar inflaton field. The evolution of this field is presented by a non-linear differential equation. This equation is considered in FLRW model...
متن کاملA Comparative Study of Least-Squares and the Weak-Form Galerkin Finite Element Models for the Nonlinear Analysis of Timoshenko Beams
In this paper, a comparison of weak-form Galerkin and least-squares finite element models of Timoshenko beam theory with the von Kármán strains is presented. Computational characteristics of the two models and the influence of the polynomial orders used on the relative accuracies of the two models are discussed. The degree of approximation functions used varied from linear to the 5th order. In ...
متن کاملUnderstanding the 8 : 1 cavity problem via scalable stability analysis algorithms
Stability analysis algorithms coupled with a robust steady state solver are used to understand the behavior of the 2D model problem of thermal convection in a 8 : 1 differentially heated cavity. The system is discretized using a Galerkin=Least Squares Finite Element formulation, and solved to steady state on parallel computers using a fully coupled Newton method and iterative linear solvers. An...
متن کامل